Based on RSA and Factoring
نویسندگان
چکیده
Abstract—Non-malleability is an important property in commitment schemes. It can resist to the person-in-the-middle (PIM) attacks within the interaction. In this paper, we focus on the non-malleability in ID-based trapdoor commitments. We first give two constructions of (full) ID-based trapdoor commitment schemes based on RSA and Factoring assumptions respectively and then extend them to non-malleable schemes. The formal proofs show that our proposed schemes satisfy all the desired security properties.
منابع مشابه
The Representation Problem Based on Factoring
We review the representation problem based on factoring and show that this problem gives rise to alternative solutions to a lot of cryptographic protocols in the literature. And, while the solutions so far usually either rely on the RSA problem or the intractability of factoring integers of a special form (e.g., Blum integers), the solutions here work with the most general factoring assumption....
متن کاملBreaking RSA May Be Easier Than Factoring
We provide evidence that breaking low-exponent rsa cannot be equivalent to factoring integers. We show that an algebraic reduction from factoring to breaking low-exponent rsa can be converted into an e cient factoring algorithm. Thus, in e ect an oracle for breaking rsa does not help in factoring integers. Our result suggests an explanation for the lack of progress in proving that breaking rsa ...
متن کاملOn the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides some evidence towards the validity of this equivalence. We show that any e cient generic ring algorithm which solves the ( exible) low-exponent RSA problem can be converted into an e cient factoring algorithm. Thus, the low-expo...
متن کاملFactorization of a 512-Bit RSA Modulus
On August we completed the factorization of the bit digit number RSA with the help of the Number Field Sieve factoring method NFS This is a new record for factoring general numbers Moreover bit RSA keys are frequently used for the protection of electronic commerce at least outside the USA so this factorization represents a breakthrough in research on RSA based systems The previous record factor...
متن کامل1 Factorization of a 512 { bit RSA Modulus
On August 22, 1999, we completed the factorization of the 512{bit 155{digit number RSA{155 with the help of the Number Field Sieve factoring method (NFS). This is a new record for factoring general numbers. Moreover, 512{bit RSA keys are frequently used for the protection of electronic commerce|at least outside the USA|so this factorization represents a breakthrough in research on RSA{based sys...
متن کامل